Tactical decompositions in uniform normal designs
نویسندگان
چکیده
منابع مشابه
Tactical decompositions of designs over finite fields
Abstract. An automorphism group of an incidence structure I induces a tactical decomposition on I. It is well known that tactical decompositions of t-designs satisfy certain necessary conditions which can be expressed as equations in terms of the coefficients of tactical decomposition matrices. In this article we present results obtained for tactical decompositions of q-analogs of t-designs, mo...
متن کاملOn Strong Tactical Decompositions
If a 2-(v, k, k) design 2) admits a tactical decomposition with d point classes and c block classes then b — v ^ c—d ^ 0, (see [3]). Decompositions for which b+d = v + c are of special interest (see for instance [1]), and are called strong. Any tactical decomposition of a symmetric design is strong. A strong tactical decomposition of a design is called a strong resolution if it has only one poi...
متن کاملUniform Designs Limit Aliasing
When fitting a linear regression model to data, the effects not included in the model can confound those included in the model, resulting in incorrect estimates of the regression coefficients and incorrect inferences as to whether a term is significant. This paper shows how uniform designs can reduce this aliasing. The discrepancy is a quantitative measure of how uniformly design points are pla...
متن کاملTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Block’s lemma states that the numbers m of point-classes and n of block-classes in a tactical decomposition of a 2-(v, k, λ) design with b blocks satisfy m ≤ n ≤ m+ b− v. We present a strengthening of the upper bound for the case of Steiner systems (2-designs with λ = 1), together with results concerning the structure of the block-classes in both extreme cases. Applying the results to the Stein...
متن کاملHamiltonian decompositions of complete k-uniform hypergraphs
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We then consider the problem of constructing such decompositions for complete uniform hypergraphs, and describe its relationship with other topics, such as design theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1986
ISSN: 0024-3795
DOI: 10.1016/0024-3795(86)90183-7